Universit at Bielefeld Forschungsschwerpunkt Mathematisierung | Strukturbildungsprozesse on Simultaneous versus Iterative Multiple Sequence Alignment on Simultaneous versus Iterative Multiple Sequence Alignment
نویسندگان
چکیده
One of the main problems in computational biology is the construction of biologically plausible alignments for given sequence families. Many procedures have been developed for this purpose; most are based on clustering the sequences hierarchically prior to the computation of their alignment and then proceeding recursively. In this paper, we compare results obtained with a new algorithm for simultaneous multiple sequence alignment, the so-called Divide & Conquer Alignment procedure (DCA), with results obtained with iterative procedures. DCA allows one to simultaneously align relatively large families of sequences using computa-tionally eecient heuristics which { relative to the sum-of-pairs scoring function which DCA accepts as the standard of truth { give rise to good (though not necessarily optimal) alignments. As expected, the simultaneous alignments often prove superior in picking up biologically important signals contained in a family of highly diverged sequences, which are sometimes overlooked by successive pairwise alignment.
منابع مشابه
An Application of the ABS LX Algorithm to Multiple Sequence Alignment
We present an application of ABS algorithms for multiple sequence alignment (MSA). The Markov decision process (MDP) based model leads to a linear programming problem (LPP), whose solution is linked to a suggested alignment. The important features of our work include the facility of alignment of multiple sequences simultaneously and no limit for the length of the sequences. Our goal here is to ...
متن کاملSATCHMO-JS: a webserver for simultaneous protein multiple sequence alignment and phylogenetic tree construction
We present the jump-start simultaneous alignment and tree construction using hidden Markov models (SATCHMO-JS) web server for simultaneous estimation of protein multiple sequence alignments (MSAs) and phylogenetic trees. The server takes as input a set of sequences in FASTA format, and outputs a phylogenetic tree and MSA; these can be viewed online or downloaded from the website. SATCHMO-JS is ...
متن کاملProgressive structure-based alignment of homologous proteins: Adopting sequence comparison strategies.
Comparison of multiple protein structures has a broad range of applications in the analysis of protein structure, function and evolution. Multiple structure alignment tools (MSTAs) are necessary to obtain a simultaneous comparison of a family of related folds. In this study, we have developed a method for multiple structure comparison largely based on sequence alignment techniques. A widely use...
متن کاملParallelization of the MAFFT multiple sequence alignment program
SUMMARY Multiple sequence alignment (MSA) is an important step in comparative sequence analyses. Parallelization is a key technique for reducing the time required for large-scale sequence analyses. The three calculation stages, all-to-all comparison, progressive alignment and iterative refinement, of the MAFFT MSA program were parallelized using the POSIX Threads library. Two natural paralleliz...
متن کاملA Method of Multiple Protein Sequence Alignment Using a Hybrid Approach
Multiple protein sequence alignment is an extension of pairwise alignment to incorporate more than two sequences at a time. Multiple protein sequence alignment methods try to align all of the sequences in a given query set. Multiple protein sequence alignments are often used in identifying conserved sequence regions across a group of sequences hypothesized to be evolutionarily related. Many app...
متن کامل